Leveled Multi-Hop Multi-Identity Fully Homomorphic Encryption

نویسندگان

چکیده

Gentry, Sahai, and Waters (CRYPTO 2013) proposed the notion of multi-identity fully homomorphic encryption (MIFHE), which allows evaluation data encrypted under multiple identities. Subsequently, Clear McGoldrick (CANS 2014, CRYPTO 2015) leveled MIFHE candidates. However, is either based on i O , a nonstandard assumption or single hop; that is, an arbitrary “evaluated” ciphertext set identities difficult to further evaluate when new ciphertexts are additional To overcome these drawbacks, we propose multi-hop scheme. In scheme, one can group obtain ciphertext, be evaluated with other We also show scheme secure against selective identity chosen-plaintext attacks (IND-sID-CPA) learning errors (LWE) assumption.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bootstrappable Identity-Based Fully Homomorphic Encryption

It has been an open problem for a number of years to construct an identity-based fully homomorphic encryption (IBFHE) scheme (first mentioned by Naccache at CHES/CRYPTO 2010). At CRYPTO 2013, Gentry, Sahai and Waters largely settled the problem by presenting leveled IBFHE constructions based on the Learning With Errors problem. However their constructions are not bootstrappable, and as a result...

متن کامل

Fully Dynamic Multi Target Homomorphic Attribute-Based Encryption

We propose multi target homomorphic attribute-based encryption (MT-HABE) with fully dynamic homomorphic evaluation: it can take as input arbitrary additional ciphertexts during homomorphic computation. In the previousMT-HABE of Brakerski et al. (TCC 2016-B), the output of homomorphic computation, which is related to a policy set, cannot be computedwith a fresh ciphertext whose attribute does no...

متن کامل

(Leveled) Fully Homomorphic Signatures from Lattices

In a homomorphic signature scheme, given a vector of signatures ~σ corresponding to a dataset of messages ~ μ, there is a public algorithm that allows to derive a signature σ′ for message μ′ = f(~ μ) for any function f . Given the tuple (σ′, μ′, f) anyone can publicly verify the result of the computation of function f . Along with the standard notion of unforgeability for signatures, the securi...

متن کامل

Faster Fully Homomorphic Encryption

We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardness assumptions (the one related to the Sparse Subset Sum Problem) and we introduce a probabilistic decryption algorithm that can be implemented with an algebraic circuit of low multiplicative degree. Combined together, these improv...

متن کامل

Fully Homomorphic Encryption

Achieving fully homomorphic encryption, under any kind of reasonable computational assumptions (and under any reasonable definition of ”reasonable”..), was a holy grail of cryptography for many years until finally achieved by Craig Gentry in 2009. In these lectures we’ll describe a somewhat simplified variant of Gentry’s construction obtained by van Dijk, Gentry, Halevi and Vaikuntanathan (with...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Security and Communication Networks

سال: 2022

ISSN: ['1939-0122', '1939-0114']

DOI: https://doi.org/10.1155/2022/1023439